Pareto Set-based Ant Colony Optimization for Multi-Objective Surgery Scheduling Problem
نویسندگان
چکیده
منابع مشابه
Pareto Set-based Ant Colony Optimization for Multi-Objective Surgery Scheduling Problem
Surgery scheduling determines the individual surgery’s sequence and assigns required resources. This task plays a decisive role in providing timely treatment for the patients while ensuring a balanced hospital resources’ utilization. Considering several real life constraints associated with multiple resources during the complete 3-stage surgery flow, a surgery scheduling model is presented with...
متن کاملAnt Colony Optimization for Multi-objective Digital Convergent Product Network
Convergent product is an assembly shape concept integrating functions and sub-functions to form a final product. To conceptualize the convergent product problem, a web-based network is considered in which a collection of base functions and sub-functions configure the nodes and each arc in the network is considered to be a link between two nodes. The aim is to find an optimal tree of functionali...
متن کاملPareto-based multi-colony multi-objective ant colony optimization algorithms: an island model proposal
Multi-objective algorithms are aimed to obtain a set of solutions, called Pareto set (PS), covering the whole Pareto front (PF), i.e. the representation of the optimal set of solutions. To this end, the algorithms should yield a wide amount of near-optimal solutions with a good diversity or spread along this front. This work presents a study on different coarse-grained distribution schemes deal...
متن کاملAnt Colony Algorithm for Surgery Scheduling Problem
Considering the complete process of surgery including the preoperative and postoperative stages, multiple resource constraints involved and the integration of surgical upstream and downstream resources, surgery scheduling was described as an extended multi-resource constrained flexible job-shop scheduling problem and an optimization approach was proposed based on an improved ant colony algorith...
متن کاملPareto-Based Optimization for Multi-objective Nurse Scheduling
In this paper, we propose a search technique for nurse scheduling, which deals with it as a multi-objective problem. For each nurse, we first randomly generate a set of legal shift patterns which satisfy all shift-related hard constraints. We then employ an adaptive heuristic to quickly find a solution with the least number of violations on the coverage-related hard constraint, by assigning one...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Open Cybernetics & Systemics Journal
سال: 2014
ISSN: 1874-110X
DOI: 10.2174/1874110x01408011211